On Multiperiodic Infinite Recursions and Their Finite Core
نویسنده
چکیده
We define multiperiodic infinite recursions and show that for such a recursion there is a finite linear recursion, the finite core, which gives almost the same type of recur-sion except for a different offset. Moreover, if we add the sequences produced by all multiperiodic infinite recursions with a given finite core, we almost obtain a multiple of the sequence associated with the finite core.
منابع مشابه
Semi-Analytical Modeling of Electromagnetic Performances in Magnet Segmented Spoke-Type Permanent Magnet Machine Considering Infinite and Finite Soft-Magnetic Material Permeability
In this paper, we present a semi-analytical model for determining the magnetic and electromagnetic characteristics of spoke-type permanent magnet (STPM) machine considering magnet segmentation and finite soft-material relative permeability. The proposed model is based on the resolution of the Laplace’s and Poisson’s equations in a Cartesian pseudo-coordinate system with respect to the relative ...
متن کاملEstimation of AR Parameters in the Presence of Additive Contamination in the Infinite Variance Case
If we try to estimate the parameters of the AR process {Xn} using the observed process {Xn+Zn} then these estimates will be badly biased and not consistent but we can minimize the damage using a robust estimation procedure such as GM-estimation. The question is does additive contamination affect estimates of “core” parameters in the infinite variance case to the same extent that it does in the ...
متن کاملQuantum Automata for some Multiperiodic Languages
We exhibit small size measure-once one-way quantum finite automata (mo-1qfa’s) inducing multiperiodic stochastic events. Moreover, for certain classes of multiperiodic languages, we exhibit: (i) isolated cut point mo-1qfa’s whose size logarithmically depends on the periods; (ii) Monte Carlo mo-1qfa’s whose size logarithmically depends on the periods and polynomially on the inverse of the error ...
متن کاملLinear Nonquadratic Optimal Control - Automatic Control, IEEE Transactions on
We consider the optimization of nonquadratic measures of the transient response. We present a computational implementation of dynamic programming recursions to solve finite-horizon problems. In the limit, the finite-horizon performance converges to the infinite-horizon performance. We provide conditions based on finite-horizon computations which only assure that a receding horizon implementatio...
متن کاملOperationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are generated that correspond to the expansion of recursive solutions over every finite depth. Previous attempts to address the problem, such as Shavlik’s generalization-to-N EBG method, are overly reluctant to expand recursio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011